Dense Time and Temporal Constraints With 6 =
نویسنده
چکیده
In some temporal reasoning systems, inequations can give rise to disjunctions of inequa-tions when variable elimination is performed. Motivated by this observation, we extend previous research on temporal constraints by considering disjunctions of inequations (under the assumption that time is dense.) We present results on consistency checking, canonical forms and variable elimination for this new class of temporal constraints.
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملA mathematical model for the multi-mode resource investment problem
This paper presents an exact model for the resource investment problem with generalized precedence relations in which the minimum or maximum time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the resource investment co...
متن کاملSpecifying Safety-Critical Systems with a Decidable Interval Temporal Logic
Punctual timing constraints are important in formal modeling of safety-criticalreal-time systems. But they are very expensive to express in dense time. Inmost cases, punctuality and dense-time lead to undecidability. E↵orts havebeen successful to obtain decidability; but the results are either non-primitiverecursive or nonelementary. In this paper we propose an interval temporal...
متن کاملTemporal Logic + Timed Automata : Expressiveness and
We investigate the veriication problem of timed automata w.r.t. linear-time dense time temporal logics. We propose a real-time logic TATL which extends the propositional temporal logic with constraints involving timed automata. These constraints allow to require that the computation segment since some designated point is accepted by a given timed automaton. We identify an expressively powerful ...
متن کاملTemporal Logic + Timed
We investigate the veriication problem of timed automata w.r.t. linear-time dense time temporal logics. We propose a real-time logic TATL which extends the propositional temporal logic with constraints involving timed automata. These constraints allow to require that the computation segment since some designated point is accepted by a given timed automaton. We identify an expressively powerful ...
متن کامل